A Strategy Language for Solving CSPs

نویسندگان

  • Carlos Castro
  • Eric Monfroy
چکیده

In this paper we propose a strategy language for designing single constraint solvers as well as their collaborations. Based on the notions of constraint lter, separator, and sorter, we deene basic strategy operators that allow us to specify single solvers and their collaboration in a uniform way. We exemplify the use of this language by specifying some techniques for solving constraints over nite and real domains.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Control Language for Designing Constraint Solvers

We propose a strategy language for designing single constraint solvers as well as their collaborations. Based on the notions of constraint lter, separator, and sorter, we deene basic strategy operators that allow us to specify single solvers and their collaboration in a uniform way. We exemplify the use of this language by specifying some techniques for solving non-linear constraints over real ...

متن کامل

A Reformulation Strategy for Multi-Dimensional CSPs: The Case Study of the SC Set Game

In this paper we describe a reformulation strategy for solving multi-dimensional Constraint Satisfaction Problems (CSPs). This strategy operates by iteratively considering, in isolation, each one of the uni-dimensional constraints in the problem. It exploits the approximate symmetries identified on the domain values in order to enforce the selected constraint on the simplified problem. This pap...

متن کامل

A Reformulation Strategy for Multi-Dimensional CSPs: The Case Study of the SET Game

In this paper we describe a reformulation strategy for solving multi-dimensional Constraint Satisfaction Problems (CSPs). This strategy operates by iteratively considering, in isolation, each one of the uni-dimensional constraints in the problem. It exploits the approximate symmetries identified on the domain values in order to enforce the selected constraint on the simplified problem. This pap...

متن کامل

Adaptive Neighborhood Inverse Consistency as Lookahead for Non-Binary CSPs

Freuder and Elfe (1996) introduced Neighborhood Inverse Consistency (NIC) for binary CSPs. In this paper, we introduce RNIC, the extension of NIC to nonbinary CSPs, and describe a practical algorithm for enforcing it. We propose an adaptive strategy to weaken or strengthen this property based on the connectivity of the network. We demonstrate the effectiveness of RNIC as a full lookahead strate...

متن کامل

Mapping Reading Anxiety on Reading Strategy Uses among Iranian Students with Diverse Proficiency Levels

The present study was an attempt to determine a relationship between foreign language reading anxiety and reading strategy use among a group of EFL Iranian readers (no = 100) with low vs. high proficiency levels. To this end, FLRAS (Foreign Language Reading Anxiety Scale) developed by Saito, Horwitz, and Garza, (1999) was used in order to measure the participants’ level of anxiety in reading an...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007